A Taxonomy of Morphic Sequences
نویسندگان
چکیده
In this note we classify sequences according to whether they are morphic, pure morphic, uniform morphic, pure uniform morphic, primitive morphic, or pure primitive morphic, and for each possibility we either give an example or prove that no example is possible.
منابع مشابه
Decidability of Uniform Recurrence of Morphic Sequences
We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic sequences are primitive substitutive sequences.
متن کاملOn Uniformly Recurrent Morphic Sequences
In the paper we mainly deal with two well-known types of in nite words: morphic and uniformly recurrent (=almost periodic). We discuss the problem of nding criterion of uniform recurrence for morphic sequences and give e ective polynomial-time such criterion in two particular cases: pure morphic sequences and automatic sequences. We also prove that factor complexity of arbitrary uniformly recur...
متن کاملOn Subword Complexity of Morphic Sequences
We study structure of pure morphic and morphic sequences and prove the following result: the subword complexity of arbitrary morphic sequence is either Θ(n) for some k ∈ N, or is
متن کاملOn GCD-morphic sequences
This note is a response to one of the problems posed by Kwa´sniewski in [1, 2], see also [3] i.e. GCD-morphic Problem III. We show that any GCD-morphic sequence F is at the point product of primary GCD-morphic sequences and any GCD-morphic sequence is encoded by natural number valued sequence satisfying condition (C1). The problem of general importance-for example in number theory was formulate...
متن کاملMix-Automatic Sequences
Mix-automatic sequences form a proper extension of the class of automatic sequences, and arise from a generalization of finite state automata where the input alphabet is state-dependent. In this paper we compare the class of mix-automatic sequences with the class of morphic sequences. For every polynomial φ we construct a mix-automatic sequence whose subword complexity exceeds φ. This stands in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1711.10807 شماره
صفحات -
تاریخ انتشار 2017